Cryptographic method

ABSTRACT

A cryptographic method including selecting secret keys p and q, being prime numbers greater than 3, selecting public parameters for a series of data values which belong to one of a plurality of pairs of groups whereby any one of the data values in one of the pairs of groups is recovered by performing an operation kN i  +1 times modulo n beginning with the any one of the data values, where k is an integer, N i  is the order of the ith pair of groups and n=p.q, selecting a public encryption key e which is a factor of kN i  +1 for all i, and processing communications data as a member of one of the pairs of groups by performing the operation on the communications data, whereby the order N i  of the pair of groups i that the communications data belongs to can be determined on the basis of p and q, and a secret decryption key d i  can be determined using e.d i  =kN i  +1.

The present invention relates to cryptology and, in particular, to a cryptographic method which can be used for public key encryption and to produce digital signatures.

Cryptographic techniques have become of significant practical importance in the area of digital communications, particularly with the increasing prevalence of digital telecommunications networks. Development has concentrated on schemes which allow message data, often referred to as plaintext, to be encrypted using a key which is available to the public, to produce ciphertext which can only be decrypted using a secret key that is related to the public key but which cannot be derived therefrom. Schemes of this nature were first discussed in W. Diffie and M. E. Hellman, "New Directions in Cryptography", IEEE Transactions on Information Theory, Vol. 22, No. 6, 1976, pp. 644-654, and the first practical implementation was proposed in R. L. Rivest, A. Shamir and L. Adeleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", Communications of the ACM, Vol. 21, No. 2, 1978, pp. 120-126, and is known as RSA. The schemes can also be used to produce digital signatures, where the plaintext can be signed by encrypting with the secret key, and then read using the public key.

The cryptographic operations performed on the ciphertext and plaintext are best described and defined using mathematical formula and symbols that depict the cryptographic process as being a sequence of mathematical operations on the numerical value represented by the bits of the data forming the plaintext or ciphertext. RSA, for example, involves a sequence of operations which are performed in modulo n arithmetic, where n is part of the public key and is the product of two large primes p and q, that constitute the secret key. The security of RSA relies primarily on the difficulty of factoring the composite number n. Although relatively secure and simple to implement, RSA is susceptible to homomorphic attack, where valid digital signatures can be produced from the combination of previously signed messages that have been recorded.

Elliptic curves over finite fields have also been found to be applicable to cryptology where the points on a curve can form a group and where an initial point can be used to derive other points in the group in a cyclical manner until the initial point of the curve is obtained again. The plaintext can be made a coordinate of a point on an elliptic curve and encrypted by performing the operations on the point to move it to another point within the group. The message can only be retrieved by knowing the characteristics of the curve and the order of the group to which the plaintext belongs. The elliptic curve operations are also performed modulo n, where n is the product of two large primes p and q. The first elliptic curve based scheme which is analogous to RSA is proposed in K. Koyama, U. M. Maurer, T. Okamoto and S. A. Vanstone, "New Public-Key Schemes based on Elliptic Curves over the Ring Zn", CRYPTO '91 Abstracts, Santa Barbara, Calif., pp. 6-1 to 6-7, 11-15 August, 1991. The paper essentially describes two schemes, discussed hereinafter, which can be used for the same applications as RSA, one can only be used to produce digital signatures, while the second scheme can also be used for public key encryption. The latter scheme, however, is restricted in the types of primes, p and q, and the types of elliptic curves which can be used, and a second coordinate needs to be transmitted with the ciphertext to enable decryption. The first scheme has the disadvantages that the digital signatures are roughly twice as long as the message or plaintext and that trial and error is required to locate a point on the elliptic curve corresponding to a plaintext, which involves incrementing the value x of the plaintext.

In accordance with the present invention there is provided a cryptographic method including:

selecting secret keys p and q, being prime numbers greater than 3;

selecting public parameters for a series of data values which belong to one of a plurality of pairs of groups whereby any one of said data values in one of said pairs of groups is recovered by performing an operation kN_(i) +1 times modulo n beginning with said any one of said data values, where k is an integer, N_(i) is the order of the ith pair of groups and n=p.q;

selecting a public encryption key e which is a factor of kN_(i) +1 for all i; and processing communications data as a member of one of said pairs of groups by performing said operation on said communications data, whereby the order N_(i) of the pair of groups i that said communications data belongs to can be determined on the basis of p and q, and a secret decryption key d_(i) can be determined using e.d_(j) =kN_(j) +1.

A preferred embodiment of the present invention is hereinafter described, by way of example only, with reference to the accompanying drawing, wherein:

FIG. 1 is a diagram of an elliptic curve used in a preferred embodiment of a cryptographic method.

The preferred embodiment involves operations based on the elliptic curve

    y.sup.2 =x.sup.3 +ax+b                                     (1)

where a and b are constants chosen so that

    4a.sup.3 +27b≠0                                      (2)

which ensures that the cubic equation

    z=x.sup.3 +ax+b                                            (3)

has three distinct roots. The graph of the curve is as shown in FIG. 1 if Equation 1 has three real roots. The curve has the property that if a non-vertical line 2 intersects it at two rational points (x₁,y₁) and (x,₂ y₂) then a third rational point of intersection (x₃, y₃) will exist. A tangent 3 to the curve is considered to have a double point of intersection (x_(k), y_(k)) at the point of tangency. If two points (x₁,y₁) and (x₂, Y₂) are known then the third point of intersection (x₃,y₃) can be obtained by the following

    x.sub.3 =λ.sup.2 -x.sub.1 -x.sub.2                  (4)

    y.sub.3 =λ×(x.sub.3 -x.sub.1)+y.sub.1         (5)

where if x₁ ≠x₂ then ##EQU1##

and if x₁ =x₂ then ##EQU2##

λ being the slope of the line connecting the points.

Using the curve an "addition" operation can be defined where

    (x.sub.1,y.sub.1)+(x.sub.2,y.sub.2)=(x.sub.3,-y.sub.3)     (8)

The sum of the two intersecting points does not give the third intersection point but in fact gives the reflection across the x-axis of the third intersection point (x₃,y₃), as shown in FIG. 1. To form a group of points for which every straight line which intersects the curve at two points also intersects at a third, an identity ∞ is defined for the addition operation

    (x,y)+(x,-y)=(x,-y)+(x,y)=∞                          (9)

The point ∞ can be though of as a point infinitely distant from the curve so that every vertical line passes through the point.

E(a,b) can be used to denote the group of rational points on the curve for a given a,b, including the point ∞. Rational points can be derived from one another using the addition operation.

The above arithmetic operations also apply if performed modulo p where p is a prime number larger than 3 and a and b are integers chosen such that

    4a.sup.3 +27b.sup.2 ≠0 (mod p)                       (10)

E_(p) (a,b) can then be used to denote an elliptic curve group modulo p having elements (x,y) which are pairs of non-negative integers less than p which satisfy

    y.sup.2 ≡x.sup.3 +ax+b(mod p)                        (11)

The group includes the identity ∞, and the points in the group can be derived from one another using the addition operation. The modulo p curve of Equation 11 would of course be a discontinuous form of that illustrated in FIG. 1. A third point on the curve, R=(x₃, y₃), can be derived by adding two other points of the group, P=(x₁,y₁) and Q=(x₂, y₂),

using the following ##EQU3##

The identity element is defined such that if x₁ ≡x₂ and y₁ ≡-y₂ (mod p), then P+Q=∞, i.e., P=-Q or (x₂,-y₂)≡-(x₂, y₂) (mod p). The - symbol before a point in the group denotes the inverse of that point.

A point can be added to itself using the addition operation a number of times, i, to produce other points in the group. This is denoted as

    (x.sub.i, y.sub.i)≡(x.sub.1, y.sub.1)#i(mod p)       (15)

where (x_(i),y_(i)) is the ith point derived from the point (x₁,y₁). The # operation is often referred to as multiplication, i.e., the point (x_(i), y_(i)) is the result of multiplying the point (x₁,y₁) by i. Efficient methods, as discussed hereinafter, arc available to perform this multiplication, for large values of i, by performing a chain of addition operations on ascending pairs of points in the group.

For example, (x₂, y₂) can be obtained by treating (x₁, y₁) as a double point or point tangency and adding it onto itself. Then (x₄,y₄) can be obtained by adding (x₂,y₂) onto itself, and (x₃,y₃) can be obtained by adding (x₂,y₂) onto (x₁, y₁) and (x₆, y₆), can be obtained by adding (x₃,y₃) onto (x₃, y₃) and so on.

If i equals the order of the group, the resulting point is the identity, ∞. If i is one more than the order of the group the resulting point is the original point (x₁,y₁), i.e., the group has the property that P+∞=∞+P=P.

The elliptic curve cryptographic method relies on knowing the order of or number of points in E_(p) (a,b). The order can be evaluated by observing that for a given value of x, if x³ +ax+b is a quadratic residue, i.e., possesses a square root modulo p, then there are two values of y that correspond to x, if x³ +ax+b is divisible by p, then there is only one value of y that corresponds to that x, and otherwise there are no values of y that correspond to that x. Taking also into account the point at ∞, the order of the group, denoted |E_(p) (a,b)|N_(p), is given by: ##EQU4##

where (z |P) is the Legendre symbol and z≡x³ +ax+b (mod p). The Legendre symbol is an operation performed using modulo arithmetic, in this case modulo p, to determine whether a number, in this case z, possesses a quadratic residue or not. The operation produces the value of ±1 or 0, 1 if the number is a quadratic residue, -1 if it is a quadratic non-residue and 0 if it is divisible by the modulus, p.

As an example, if p=5, and a=b=-1, the points of E₅ (-1, -1) must satisfy

    y.sup.2 ≡x.sup.3 -x-1(mod 5)                         (17)

The coordinate x is not allowed to equal 3 as 23 is not a quadratic residue modulo

5. The elements of the group are

    ______________________________________                                         (0,2), (1,2),     (2,0), (4,2),                                                (0,3), (1,3),            (4,3),   and  ∞                                 If (x.sub.1, y.sub.1) = (0, 2), then                                           (x.sub.2,                                                                           = (0, 2) + (0, 2)                                                                           λ = (3 × 0 - 1) × 4                                                         = 1 (mod 5),                                 y.sub.2)          x.sub.2 = 1 - 0 - 0                                                                            = 1 (mod 5),                                                   -y.sub.2 = 1 × (1 - 0) + 2                                                               = 3 (mod 5),                                      = (1, 2);                                                                 (x.sub.3,                                                                           = (1, 2) + (0, 2)                                                                           λ = (2 - 2) × 1                                                                   = 0 (mod 5),                                 y.sub.3)          x.sub.3 = 0 - 1 - 0                                                                            = 4 (mod 5),                                                   -y.sub.3 = 0 × (4 - 0) + 2                                                               = 2 (mod 5),                                      = (4, 3);                                                                 (x.sub.4,                                                                           = (4, 3) + (0, 2)                                                                           λ = (3 - 2) × 4                                                                   = 4 (mod 5),                                 y.sub.4)          x.sub.4 = 16 - 4 - 0                                                                           = 2 (mod 5),                                                   -y.sub.4 = 4 × (2 - 0) + 2                                                               = 0 (mod 5),                                      = (2, 0);                                                                 (x.sub.5,                                                                           = (2, 0) + (0, 2)                                                                           λ = (0 - 2) × 3                                                                   = 4 (mod 5),                                 y.sub.5)          x.sub.5 = 16 - 2 - 0                                                                           = 4 (mod 5),                                                   -y.sub.5 = 4 × (4 - 0) + 2                                                               = 3 (mod 5),                                      = (4, 2);                                                                 (x.sub.6,                                                                           = (4, 2) + (0, 2)                                                                           λ = (2 - 2) × 4                                                                   = 0 (mod 5),                                 y.sub.6)          x.sub.6 = 0 - 4 - 0                                                                            = 1 (mod 5),                                                   -y.sub.6 = 0 × (1 - 0) + 2                                                               = 2 (mod 5),                                      = (1, 3);                                                                 (x.sub.7,                                                                           = (1, 3) + (0, 2)                                                                           λ = (3 - 2) × 1                                                                   = 1 (mod 5),                                 y.sub.7)          x.sub.7 = 1 - 1 - 0                                                                            = 0 (mod 5),                                                   -y.sub.7 = 1 × (0 - 0) + 2                                                               = 2 (mod 5),                                      = (0, 3);                                                                 (x.sub.8,                                                                           = (0, 3) + (0, 2) = ∞.                                              y.sub.8)                                                                       ______________________________________                                    

A practical technique for computing the order of an elliptic group modulo p for large p is discussed in A.K. Lenstra and H.W. Lenstra, Jnr., "Algorithms in Number Theory", University of Chicago, Department of Computer Science, Technical Report #87-008, 1987. Two particular cases using the technique are discussed in D. M. Bressoud, Factorisation and Primality Testing, Springer-Verlag, N.Y., 1989 and are as follows. The equations for the orders used in the two cases were proved by a mathematician, Andre Well in 1952.

In the first case, if p is an ordinary prime which is congruent to 1 modulo 4, r is a complex prime that divides p and is congruent to 1 modulo 2+2i, and D is any integer not divisible by p then the order of E_(p) (-D,0) is ##STR1##

where (x/r)₄ is the fourth power symbol and r is the conjugate of the complex integer r.

For example, if p=13 and r=3+2i, then

    |E.sub.13 (-1,0)|=14-(1)(3+2i)-(1)(3-2i)=8

    |E.sub.13 (1,0)|=14-(-1)(3+2i)-(-1)(3-2i)=20

    |E.sub.13 (-2,0)|=14-(i)(3+2i)-(-i)(3-2i)=18

    E.sub.13 (2,0)|=14-(-i)(3+2i)-(i)(3-2i)=10

In the second case, if p is an ordinary prime which is congruent to 1 modulo 3, r is a cubic prime that divides p and is congruent to 2 modulo 3 and D is any integer not divisible by p then the order of E_(p) (0,D) is ##STR2##

where (x|r)₆ is the sixth power symbol and r is the conjugate of the cubic integer r.

For example, if p=13 and r=-4-3ω, where ω=e^(2xi/3), then

    |E.sub.13 (0,1)|=14+(ω.sup.2)(-4-3ω)+(ω)(-1+3ω)=12

    |E.sub.13 (0.2)|=14+(-1)(-4-3ω)+(-1)(-1+3ω)=19

    |E.sub.13 (0,3)|=14+(1)(-4-3ω)+(1)(-1+3ω)=9

    |E.sub.13 (0,4)|=14+(ω)(-4-3ω)+(ω.sup.2)(-1+3ω)=21

    |E.sub.13 (0,5)|=14+(-ω.sup.2)(-4-3ω)+(-ω)-1+3ω)=16

    |E.sub.13 (0,6)|=14+(-ω)(-4-3ω)+(-ω.sup.2)(-1+3ω)=7

It has also been shown that for every elliptic curve of Equation 11 ##EQU5##

The above illustrates that the order of the group E_(p) (a,b) can be determined.

For the group Ep(a,b), the following applies

    (x.sub.1, y.sub.1)#{p+1+α}(mod p)=∞            (21)

and therefore

    (x.sub.1,y.sub.1)#{m(p+1+α)±1}(mod p)=(x.sub.1,±y.sub.1) (22)

where m is an arbitrary integer. Equation 22 includes a ± value as the group E_(p) (a,b) is symmetrical about ∞ because 1 point past ∞, (x₁,y₁) is obtained, whereas one point short of ∞, (x₁,-y₁) is obtained, and only the plaintext x₁ is of interest. The term in { } of Equation 22 can be considered to be equal to e.d, where e constitutes an encryption key and d constitutes a decryption key. Therefore for encryption of a message or plaintext which has a value x₁ that is a coordinate of the point (x₁, y₁) on the elliptic curve, the following encryption operation can be performed

    (x.sub.e, y.sub.e)≡(x.sub.1,y.sub.1)#e(mod p)        (23)

The ciphertext x_(e) can then be decrypted using

    (x.sub.1,y.sub.1)≡(x.sub.e,y.sub.e)#d(mod p)         (24)

Also to apply a digital signature to the plaintext the following operation is executed

    (x.sub.d,y.sub.d)≡(x.sub.1,y.sub.1)#d(mod p)         (25)

and then the signature can be validated by executing the following

    (x.sub.1, y.sub.1)≡(x.sub.d,y.sub.d)#e(mod p)        (26)

Once the prime p is selected and the order of the group E_(p) (a,b) is known, e is randomly selected and d can be determined according to the Equation 22 from the following

    e.d≡±1mod(p+1+α)                            (27)

The same also applies for a group E_(q) (a,b) based on another large prime q such that

    (x.sub.1,y.sub.1)#{k(q+1+β)+1}(mod q)=(x.sub.1,y.sub.1) (28)

where q+1+β is the order N_(q) of the group E_(q) (a,b), k is an arbitrary integer, and |β|≦2√q.

The points on E_(a) (a,b), where n=p.q, can each be represented uniquely by a pair of the points of E_(p) (a,b) and E_(q) (a,b), according to the Chinese Remainder Theorem (CRT) for modulo arithmetic, therefore the encryption and decryption schemes of Equations 23 to 26 can be performed in modulo n, where n is made public and p and q are kept secret. Again, once e is selected d is then determined using

    e.d≡±1mod(N.sub.a)                                (29)

where N_(a) ≡N_(p) N_(q) or N_(a) =1cm(N_(p) N_(q)) can only be determined if p and q are known, which enables N_(p) and N_(q) to be determined as shown previously.

Encryption and digital encryption schemes which use specific elliptic curve groups are discussed in K. Koyama, U. M. Maurer, T. Okamoto and S. A. Vanstone, "New Public-Key Schemes based on Elliptic Curves over the Ring Zn", CRYPTO '91 Abstracts, Santa Barbara, Calif., pp. 6-1 to 6-7, 11-15 August, 1991. One of the schemes can be only used for digital signatures as both p and q need to be known to find a point on E_(a) (a,b) which corresponds to the plaintext, because a square root modulo n needs to be found for z≡y^(z) =(mod n). Also the plaintext generally needs to be incremented to find a value of x, representing the plaintext, which gives a z that is a quadratic residue modulo n. This can be a time consuming process as many values may have to be tried before a valid value can be found. The signature used in the scheme is also approximately twice as long as the original plaintext or message data. For the encryption schemes proposed in the paper, only odd primes can be used for p and q which satisfy p≡q≡2 (mod 3) or p≡q≡3 (mod 4). This restricts the orders of the groups used to p+1 and q+1, which cannot be changed. The schemes do not allow for use of general elliptic groups E_(p) (a,b) and E_(q) (a,b) for which the order of these groups can be determined. Also both coordinates (x,y) need to be specified during the encryption process and sent to a receiver. This enables the sender and receiver to determine the curve on which the encryption process is operating, as the curve used is not the same for each message, because the constraints discussed above require a curve and message to be fitted to one another for each message.

The preferred embodiment of the present invention provides a cryptographic method which fixes the curve used by allowing the plaintext x to represent a coordinate of a point (x,y) where y is indeterminant for the field of the curve for non-negative integer values of x. This first requires the creation and definition of a complimentary group, as discussed below, for the elliptic curve modulo p.

For the complimentary group, p is a prime, greater than 3, and again, a and b are chosen so that Equation 10 holds. The group is denoted by E_(p) (a,b) and its elements (x,y) satisfy Equation 11 but y is indeterminant for non-negative integer values of x. The indeterminant coordinate y is considered to be of the form y=u√v where u is a non-negative integer less than p and v is a fixed quadratic non-residue modulo p. The identity element ∞ and the addition operation are identical to those described previously for the standard group E_(p) (a,b).

In the complimentary group if P=(x₁,y₁)=(x₁, u₁ √v) and /Q=(x₂, y₂)=(x₂, u₂ √v) are two elements in the group, then R=(x₃,y₃)=(x₃, u₃ √v) is also in the group, i.e.,

    (x.sub.1,y.sub.1)+(x.sub.2,y.sub.2)≡(x.sub.3,y.sub.3) (mod p), (30)

where, if x₁ ≠x₂ (mod p), ##EQU6##

or, if x₁ ≡x₂ and y₁ ≠-y₂ (mod p), ##EQU7##

This demonstrates the closure property of the group in that a point (x₃,y₃) in the group can be obtained from addition of two other points (x₁, y₁) and (x₂, y₂) in the group. It also can be shown that other group axioms hold for the complementary group. The order of the complementary group is given by ##EQU8##

where (z|p) is the Legendre symbol and z≠x³ +ax+b (mod p). Equation 35 follows because, for the complementary group, in addition to the point at infinity, for a given value of x:

1. There are two values of y that correspond to that value of x, if z is a quadratic non-residue modulo p;

2. There is one value of y that corresponds to that value of x, if z≠0 modulo p; and

3. There are no values of y that correspond to that value of x, if z is a quadratic residue.

If there are A values of x for which (z|p)=1, B values of x for which (z|p)=0 and C values of x for which (z|P)=-1 then, since x must be one of p possible values, because there arc only p values of x which produce unique values of z.

    A+B+C=p                                                    (36)

From Equations 16 and 20

    |E.sub.p (a,b)|=1+2A+B=1+p+α,      (37)

    2A+B=p+α                                             (38)

Consequently, from Equations 35, 36 and 38,

    |E.sub.p (a,b)|=1+2C+B=1+2p-(2A+B)=1+p-α(39)

This establishes the order of the complementary group |E_(p) (a,b)| in terms of the parameters of the order of the standard group |E_(p) (a,b)|. A similar expression also holds for another large prime q. An encryption method can therefore be established using a fixed curve and obtaining points on the curve which may be in, for modulo n operations, one of four pairs of groups, the standard groups for both p and q, the complimentary groups for both p and q, the standard group for p and the complimentary group for q, or the standard group for q and the complimentary group for p. The two primes, p and q are randomly selected, together with parameters a and b which define the elliptic curve. The arithmetic modulus n=p.q is calculated, gcd (4a³ +27b², n)=1 is checked, and the order of the groups for primes p and q are as follows |E_(p) (a,b)|=1+p+α,|E_(q) (a,b)|=1+p-α, |E_(q) (a,b)|=1+q+β and |Eq(a,b)|=1+q-β. The orders of these groups can then be calculated as discussed previously. The plaintext is represented by x and s represents the ciphertext, where 0≦x, s≦n-1.

Encryption is performed according to the following

    (s,t)≡(x,y)#e(mod n)                                 (40)

and decryption is performed by

    (x,y)≡(s,t)#d.sub.i (mod n)                          (41)

where

    e.d.sub.i≡± 1(mod N.sub.i),i=1 to 4,              (42)

    gcd(e, N.sub.i)=1, i=1 to 4,                               (43) ##EQU9##

The values of N_(i) are determined by finding the lowest common multiple (1 cm) of the orders of the respective p and q groups. The encryption key e is randomly selected with the only qualification that the greatest common denominator of e and N_(i), is 1. The parameters n, a, b and the encryption key e are made available to the public so that any plaintext x can be encrypted, whereas the decryption keys d_(i) and the primes p and q are kept secret. The ciphertext s can only be decrypted by first using the Legendre symbols (w|p) and (w|q) to determine which pair of groups the ciphertext (s,t) is a member. Once this is determined, the appropriate N_(i) can be used to determine the correct encryption key d_(i) to be used which is derived using e.d_(i)≡± 1 (mod N_(i)).

If p, q, a and b are chosen so that α=β=0 in Equations 44 to 47, then N_(i) =1 cm (p+1,q+1) is constant for all i=1 to 4. Consequently only one value of d_(i) needs to be calculated and decryption is independent of Legendre symbols (w/p) and (w/q).

The decryption time can be reduced, by a factor of approximately 4, by performing the operation of Equation 41 in modulo p and modulo q and then combining the results using the Chinese Remainder Theorem.

The security of the scheme relies primarily on the inherent difficulty in factoring p and q from n which are required to derive appropriate decryption keys d_(i), but the security is also enhanced by the fact that it is difficult to determine where the point (s,t) is on the elliptic curve and to which group it belongs because only the first coordinate s is calculated and transmitted.

Computation of the second coordinates y and t can also be avoided using the doubling algorithms discussed in D. M. Bressoud, Factorisation and Primality Testing, Springer-Verlag, New York, 1989. The algorithms are as follows.

In the elliptic group E_(p) (a,b) (or E_(p) (a,b)), let (x_(i),y_(i))≡(x,y)#i (mod p). If y_(i) ≠0 (mod p), then ##EQU10##

In addition, if x_(i) ≠x_(i+1) and x≠0 (mod p), then ##EQU11##

Equation 53 cannot be used if x≡0 modulo p (or q). However, the equation can be rearranged to give ##EQU12##

which is valid for all 0≦x≦p-1 (and consequently for all 0≦x≦n-1 when computations are performed modulo n). The Equations 52 to 54 do not determine all of the points within an elliptic group but enable a sufficient number of the points to be derived to obtain the coordinate s dictated by the encryption key e.

It can be shown that x_(i) is never congruent to x_(i+1) modulo p (or q) during the course of computing s≡x_(e) modulo n, as given by Equation 40. Similarly s_(i) is never congruent to s_(i+1) modulo p (or q) during the course of computing Equation 41. However, it is possible (although extremely unlikely) that y_(i) may become congruent to 0 modulo p (or q) during the course of computations and therefore for Equation 52 to become undefined. However, homogeneous coordinates can be used which enable division to be avoided until the final stage of the encryption or decryption procedure.

Homogeneous coordinates are formed by setting x≡X/Z (mod p) and y≡Y/Z (mod p). If (x_(i),y_(i),≡(X_(i) /Z_(i), Y_(i),Z_(i))≡(X/Z, Y/Z)#i (mod p), Equations 52 and 54 can be restated in the following form using modulo n arithmetic.

    X.sub.2i ≡(X.sub.i.sup.2 -aZ.sub.i.sup.2).sup.2 -8bX.sub.i Z.sub.i.sup.3 l (mod n)                                   (55)

    X.sub.2i ≡4Z.sub.i (X.sub.i.sup.3 +aX.sub.i Z.sub.i.sup.2 +bZ.sub.i.sup.3)(mod n)                                   (56)

    X.sub.2i+1 ≡Z[4bZ.sub.i.sup.2 Z.sub.i+1.sup.2 +2(aZ.sub.i Z.sub.i+1 +X.sub.i X.sub.i+1) (X.sub.i Z.sub.i+1 +X.sub.i+1 Z.sub.i)](57)

    -X(x.sub.i Z.sub.i+1 -X.sub.i+1 Z.sub.i).sup.2 (mod n)

    Z.sub.2i+1 ≡Z(X.sub.i Z.sub.i+1 -X.sub.i+1 Z.sub.i).sup.2 (mod n) (58)

Using the homogeneous coordinate notation discussed above, the encryption and decryption procedures can be restated as follows

    s≡x.sub.e ≡X.sub.e /Z.sub.e (mod n)            (59)

where X=x and Z=1, and

    x≡s.sub.di ≡S.sub.di /Z.sub.di (mod n)         (60)

where S=s, Z=1 and d_(i) is as defined by Equations 42 to 51.

The above encryption method can be equally applied to producing digital by using the decryption key d_(i) to produce the signatures as follows

    s≡X.sub.di /Z.sub.di (mod n)                         (61)

where X=x is the message or plaintext, Z=1 and d_(i) is as defined by Equations 42 to 51 with z-x³ +ax+b (mod n) replacing w in Equations 44 to 47.

Signature verification is performed by computing:

    x≡S.sub.e /Z.sub.e (mod n)                           (62)

where S=s and Z=1.

The cryptographic method discussed above can also be applied to other number systems, such as Lucas sequences, that can be divided into similar pairs of cyclic groups where operations can be performed on the members of a pair of groups so as to generate members of the pair of groups from one member, including the initially selected member.

The cryptographic method discussed above has a number of significant advantages over previous methods, such as:

(i) The method can be used for both digital signature and encryption applications.

(ii) The message data does not need to be extended, i.e., the ciphertext and the plaintext are the same bit length.

(iii) Only the first coordinates of points on the elliptic curve need to be determined.

(iv) The method can be used for any values of p and q, greater than 3, and any values of a and b for which the order of the elliptic groups can be determined, provided gcd (4a³ +27b², n)=1.

(v) The parameters a and b remain fixed and are publicly known, therefore they do not have to be determined or calculated at either the sending or receiving terminals.

(vi) The method appears to be immune from homomorphic attack, i.e., new signatures cannot be created from a database of previously used signatures, one reason being that the second coordinate of the points on the elliptic curve are never calculated and it is difficult to add the first coordinates of two arbitrary points without knowing the corresponding second coordinates. Second coordinates can only be determined if p and q are known. 

I claim:
 1. A cryptographic method including:selecting secret keys p and q, being prime numbers greater than 3; selecting public parameters for a series of data values which belong to one of a plurality of pairs of groups whereby any one of said data values in one of said pairs of groups is recovered by performing an operation kN_(i) +1 times modulo n beginning with said any one of said data values, where k is an integer, N_(i) is the order of the ith pair of groups and n=p.q; selecting a public encryption key e which is a factor of kN_(i) +1 for all i; and processing communications data as a member of one of said pairs of groups by performing said operation on said communications data, whereby the order N_(i) of the pair of groups i that said communications data belongs to can be determined on the basis of p and q, and a secret decryption key d_(i) can be determined using e.d_(i) =kN_(i) +1.
 2. A cryptographic method as claimed in claim 1, including encrypting message data having a data value x to obtain ciphertext s by performing said operation e times on x.
 3. A cryptographic method as claimed in claim 1, including decrypting ciphertext having a data value s by determining which one of said pairs of groups s belongs to and N_(i) and d_(i) for said one of said pairs of groups on the basis of e, p, q and said public parameters, and performing said operation d_(i) times on s.
 4. A cryptographic method as claimed in claim 1, including obtaining a digital signature, on message data having a data value x by determining which one of said pairs of groups x belongs to and N_(i) and d_(i) for said one of said pairs of groups on the basis of e, p and q and said public parameters, and performing said operation d_(i) times on x.
 5. A cryptographic method as claimed in claim 1, including verifying a digital signature having a data value s by performing said operation e times to obtain plaintext.
 6. A cryptographic method as claimed in claim 3, wherein only said ciphertext s, said public parameters and p and q are required to determine said one of said pairs of groups.
 7. A cryptographic method as claimed in claim 4, wherein only said message data x, said public parameters and p and q are required to determine said one of said pairs of groups.
 8. A cryptographic method as claimed in claim 1, wherein said pairs of groups include complementary groups which include indeterminate data values.
 9. A cryptographic method as claimed in claim 1, wherein said parameters are parameters of curve and said data values represent points on said curve.
 10. A cryptographic method as claimed in claim 9, wherein said curve is elliptic.
 11. A cryptographic method as claimed in claim 10, wherein said curve includes said points (x,y) such that

    y.sup.2 =x.sup.3 +ax+b(mod n)

where a and b are said public parameters and gcd (4a³ +27b², n)=1, and said data values represent x coordinates.
 12. A cryptographic method as claimed in claim 11, wherein said operation is a point multiplication on said curve denoted by the symbol #, such that

    (x,y)#{kN.sub.i +1}≡(x,y)#e.d.sub.i ≡(x,y)(mod n).


13. A cryptographic method as claimed in claim 12, wherein y may be indeterminate and equal u√v where u is an integer and v is a fixed quadratic non-residue.
 14. A cryptographic method as claimed in claim 13, wherein for a point (s,t) obtained by performing said operation on a point (x,y), (s,t) belongs to one of four of said pairs of groups, i equal to 1, 2, 3 or 4, where ##EQU13## α and β being constants such that let |α|≦2√p and |β|≦2√q and ##EQU14## being the Legendre symbol, whereby said one of said pairs of groups has an order N₁, N₂, N₃ or N₄ and corresponding decryption key d₁, d₂, d₃ or d₄, respectively.
 15. A cryptographic method as claimed in claim 14, including encrypting plaintext having a data value x to obtain ciphertext s by performing the following

    (s,t)≡(x,y)#e(mod n).


16. A cryptographic method as claimed in claim 14, including decrypting ciphertext having a data value s to obtain plaintext x by performing the following

    (x,y)≡(s,t)#d.sub.i (mod n).


17. A cryptographic method as claimed in claim 14, including obtaining a digital signature having data value s on plaintext x by performing the following

    (s,t)≡(x,y)#d.sub.i (mod n)

and substituting z for w to determine N_(i) and d_(i).
 18. A cryptographic method as claimed in claim 14, including verifying a digital signature having a data value s to obtain plaintext x by performing the following

    (x,y)≡(s,t)#e(mod n).


19. A cryptographic method as claimed in claim 14, wherein x=X/Z (mod n) and y=Y/Z (mod n) and (x_(j), y_(j))≡(X_(j) /Z_(j), Y_(j), Z_(j) (X/Z, Y/Z)#j(mod n), and points in said groups are obtained using the following

    X.sub.2j ≡(X.sub.j.sup.2 -aZ.sub.j.sup.2).sup.2 -8bX.sub.j Z.sub.j.sup.3 ( mod n)

    Z.sub.2j ≡4Z.sub.j (X.sub.j.sup.3 +aX.sub.j Z.sub.j.sup.2 +bZ.sub.j.sup.3) (mod n)

    X.sub.2j+1 ≡Z[4bZ.sub.j.sup.2 Z.sup.2.sub.j+1 +2(aZ.sub.j Z.sub.j+1 +X.sub.j X.sub.j+1) (X.sub.j Z.sub.j+1 +X.sub.j+1 Z.sub.j)]-X(X.sub.j Z.sub.j+1 -X.sub.j+1 Z.sub.j).sup.2 (mod n)

    Z.sub.2j+1 ≡Z(X.sub.j Z.sub.j+1 -X.sub.j+1 Z.sub.j).sup.2 (mod n).


20. 20. A cryptographic method as claimed in claim 19, including encrypting plaintext having a data value x to obtain ciphertext s using the following

    s≡x.sub.e ≡X.sub.e /Z.sub.e (mod n)

where X=x and Z=1.
 21. A cryptographic method as claimed in claim 19, including decrypting ciphertext having a data value s to obtain plaintext x using the following

    x≡s.sub.di S.sub.di Z.sub.di (mod n)

where S=s, Z=1.
 22. A cryptographic method as claimed in claim 19, including generating a digital signature having a data value s from plaintext x using the following

    s≡X.sub.di /Z.sub.di (mod n)

where X=x, Z=1 and to determine N_(i) and d_(i), z is substituted for w.
 23. A cryptographic method as claimed in claim 19, including verifying a digital signature having a data value s to obtain plaintext x by performing the following:

    x≡S.sub.e /Z.sub.e (mod n)

where S=s and Z=1. 